Embed Longest Rings onto Star Graphs with Vertex Faults
نویسندگان
چکیده
The star graph has been recognized as an attractive alternative to the hypercube. Let Fe and Fv be the sets of vertex faults and edge faults, respectively. Previously, Tseng et al. showed that an n-dimensional star graph can embed a ring of length n! if |Fe |≤n-3 (|Fv|=0), and a ring of length at least n!-4|Fv | if |Fv |≤n-3 (|Fe |=0). Since an n-dimensional star graph is regular of degree n-1 and is bipartite with two partite sets of equal size, our result achieves optimality in the worst case.
منابع مشابه
Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
In this paper, we aim to embed a longest path between every two vertices of a star graph with at most n-3 random edge faults, where n is the dimension of the star graph. Since the star graph is regular of degree n1, n-3 (edge faults) is maximum in the worst case. We show that when n≥6 and there are n-3 edge faults, the star graph can embed a longest path between every two vertices, exclusive of...
متن کاملFault-free longest paths in star networks with conditional link faults
The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two ormore fault-free links, we show that an n-dimensional star network can tolerate up to 2n− 7 link faults, and be strongly (fault-free)...
متن کاملEmbed a Longest Path between Arbitrary Two Vertices of a Faulty Star Graph
The star graph Sn has been recognized as an attractive alternative to the hypercube. Since S1, S2, and S3 have trivial structures, we focus our attention on Sn with n≥4 in this paper. Let Fv denote the set of faulty vertices in Sn. We show that when |Fv|≤n−5, Sn with n≥6 can embed a fault−free path of length n!-2|Fv|−2 (n!-2|Fv|−1, respectively) between arbitrary two vertices of even (odd, resp...
متن کاملLongest fault-free paths in star graphs with vertex faults
The star graph Sn has been recognized as an attractive alternative to the hypercube. Since S1; S2, and S3 have trivial structures, we focus our attention on Sn with n¿4 in this paper. Let Fv denote the set of faulty vertices in Sn. We show that when |Fv|6n− 5; Sn with n¿6 contains a fault-free path of length n! − 2|Fv| − 2 (n! − 2|Fv| − 1) between arbitrary two vertices of even (odd) distance. ...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کامل